A Hybrid Model Schema Matching Using Constraint-Based and Instance-Based

Instance-Based OWL Schema Matching

Schema matching is a fundamental issue in many database applications, such as query mediation and data warehousing. It becomes a challenge when different vocabularies are used to refer to the same real-world concepts. In this context, a convenient approach, sometimes called extensional, instancebased or semantic, is to detect how the same real world objects are represented in different database...

Constraint - Based Schema Matching

Fuzzy Constraint-based Schema Matching Formulation

The deep Web has many challenges to be solved. Among them is schema matching. In this paper, we build a conceptual connection between the schema matching problem SMP and the fuzzy constraint optimization problem FCOP. In particular, we propose the use of the fuzzy constraint optimization problem as a framework to model and formalize the schema matching problem. By formalizing the SMP as a FCOP,...

Utilizing regular expressions for instance-based schema matching

Statistical data consists mostly of numerical values, entries of codelists like country codes or acronyms for gender. Such values are typically described according to specific patterns. In this paper we present a novel approach for instance-based schema matching, where regular expressions are utilized for matching patterns of instance values. 1 Motivation and Background In various domains, e.g....

Schema Matching for Document Exchange: A Constraint Based Approach

Information systems’ activities are increasingly becoming distributed. Many systems, therefore, need to exchange documents in order to correctly perform a critical activity. Data stores on the originating and receiving systems rarely have identical structures. As a consequence, document exchange commonly requires that the data be transformed from the originating site, to the document exchange f...